Solving some persistent presupposition problems
نویسنده
چکیده
/S0aanes 1979/provides some counterexamples to the theory of natural language presuppositions that is presented in /Gazdar 1979/. /Soames 1982/ provides a theory which explains these eounterexamples. /Mercer 1987/ rejects the solution found in/Soames 1982/ leaving these eounterexamples unexplained. By reappraising these insightful counterexamples, the inferential theory for natural language presuppositions described in/Mercer 1987, 1988/gives a simple and straightforward explanation for the presupposiitional nature of these sentences.
منابع مشابه
On the non-independence of Triggering and Projection
It is standard methodology to break a difficult problem down into its subparts in hope of solving the problem one piece at a time. The linguistic literature has taken this approach to the problem of presupposition by separating out two central questions. One question pertaining to presupposition is how or why particular presuppositions attach to particular expressions, i.e. the triggering probl...
متن کاملThe Meaning of
This work deals with the semantics of the French additive aussi. We make the broad hypothesis that its semantics closely match those of its English equivalent too. Thus, we rely on the usual formal analysis given to too, but will use experimental data on aussi. A complete analysis would test both items to check for differences, although as far as our knowledge is concerned, the differences are ...
متن کاملPredicting Presupposition Projection: some alternatives in the strong Kleene tradition∗
This paper presents an architecture for evaluating presuppositional expressions that predicts the projection behavior of functions from their (bivalent) truth-conditional contributions. The resulting system demonstrates how a static, trivalent account can compete with other alternatives to address certain theoretical complaints raised against older projection theories, and makes a number of int...
متن کاملPresupposed Content and Entailments in Natural Language Inference
Previous work has presented an accurate natural logic model for natural language inference. Other work has demonstrated the effectiveness of computing presuppositions for solving natural language inference problems. We extend this work to create a system for correctly computing lexical presuppositions and their interactions within the natural logic framework. The combination allows our system t...
متن کاملUpdating Discourse Context with Active Logic
In this paper we present our implementation of a system of active logic that processes natural language discourses. We focus on problems that involve presupposition and the associated well{known problems of the projection of presupposition. We discuss Heim's largely successful theory of presupposition and point out certain limitations. We then use these observations to build our discourse proce...
متن کامل